Перевод: с английского на русский

с русского на английский

finitary function

См. также в других словарях:

  • Finitary — In mathematics or logic, a finitary operation is one, like those of arithmetic, that takes a finite number of input values to produce an output. An operation such as taking an integral of a function, in calculus, is defined in such a way as to… …   Wikipedia

  • Finitary relation — This article sets out the set theoretic notion of relation. For a more elementary point of view, see Binary relation. For a combinatorial viewpoint, see Theory of relations. For other uses, see Relation (disambiguation). In set theory and logic,… …   Wikipedia

  • finitary — adjective Of a function, taking a finite number of arguments to produce an output …   Wiktionary

  • Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …   Wikipedia

  • Boolean-valued function — A boolean valued function, in some usages a predicate or a proposition, is a function of the type f : X → B, where X is an arbitrary set and where B is a boolean domain.A boolean domain B is a generic 2 element set, say, B = {0, 1}, whose… …   Wikipedia

  • Boolean function — In mathematics, a (finitary) Boolean function is a function of the form f : B k rarr; B, where B = {0, 1} is a Boolean domain and k is a nonnegative integer called the arity of the function. In the case where k = 0, the function is essentially a… …   Wikipedia

  • Arithmetical set — In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first order Peano arithmetic. The arithmetical sets are classified by the arithmetical hierarchy.A function f:subseteq… …   Wikipedia

  • Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y)   (cl… …   Wikipedia

  • Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… …   Wikipedia

  • Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»